Enumerating Graph Depletions
نویسندگان
چکیده
Let G be a simple, connected graph with finite vertex set V and edge set E . A depletion of G is a permutation v1v2v3 . . . vn of the elements of V with the property that vi is adjacent to some member of {v1, v2, · · · , vi°1} for each i ∏ 2. Depletions model the spread of a rumor or a disease through a population and are related to heaps. In this paper we develop techniques for enumerating the depletions of a graph.
منابع مشابه
Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph
We consider incremental maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition of edges. When new edges are added to the graph, we seek to enumerate the change in the set of maximal bicliques, without enumerating the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without expl...
متن کاملA Fast Algorithm for Enumerating Bipartite Perfect Matchings
In this paper, we propose an algorithm for enumerating all the perfect matchings included in a given bipartite graph G = (V,E). The algorithm is improved by the approach which we proposed at ISAAC98. Our algorithm takes O(log |V |) time per perfect matching while the current fastest algorithm takes O(|V |) time per perfect matching. Keyword: enumeration, enumerating algorithm, perfect matching.
متن کاملOn enumerating chordless circuits in directed graphs
We introduce and discuss an algorithm using O(p) time and O(n(n + m)) space for enumerating the m > 0 chordless circuits in a digraph of order n and containing p chordless paths. Running it on random digraphs yields some statistical insight into its practical performance.
متن کاملGeneral Graph Refinement with Polynomial Delay
Of many graph mining algorithms an essential component is its procedure for enumerating graphs such that no two enumerated graphs are isomorphic. All frequent subgraph miners require such a component [14, 5, 1, 6], but also other data mining algorithms, such as for instance [7] require such a procedure, which is often called a “refinement operator” or a “join operator” depending on the enumerat...
متن کاملEnumerating Cyclic Orientations of a Graph
Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set; it is cyclic otherwise. As far as we know, only the enumeration of acyclic orientations has been addressed in the literature. In this paper, we pose the prob...
متن کامل